./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-54.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db928b9099ad3b3be249f0cd14beba37cb15e466f6645711d89dee952c24b933 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:10:26,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:10:26,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:10:26,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:10:26,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:10:26,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:10:26,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:10:26,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:10:26,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:10:26,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:10:26,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:10:26,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:10:26,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:10:26,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:10:26,402 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:10:26,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:10:26,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:10:26,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:10:26,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:10:26,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:10:26,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:10:26,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:10:26,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:10:26,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:10:26,412 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:10:26,412 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:10:26,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:10:26,412 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:10:26,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:10:26,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:10:26,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:10:26,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:10:26,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:10:26,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:10:26,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:10:26,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:10:26,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:10:26,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:10:26,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:10:26,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:10:26,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:10:26,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:10:26,419 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db928b9099ad3b3be249f0cd14beba37cb15e466f6645711d89dee952c24b933 [2024-11-09 01:10:26,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:10:26,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:10:26,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:10:26,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:10:26,787 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:10:26,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-54.i [2024-11-09 01:10:28,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:10:28,423 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:10:28,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-54.i [2024-11-09 01:10:28,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e4b1217/79309e7816a6490694c60aeeb50dbb25/FLAG31a4f584b [2024-11-09 01:10:28,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e4b1217/79309e7816a6490694c60aeeb50dbb25 [2024-11-09 01:10:28,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:10:28,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:10:28,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:10:28,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:10:28,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:10:28,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@867aa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28, skipping insertion in model container [2024-11-09 01:10:28,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:10:28,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-54.i[915,928] [2024-11-09 01:10:28,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:10:28,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:10:28,795 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-54.i[915,928] [2024-11-09 01:10:28,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:10:28,829 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:10:28,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28 WrapperNode [2024-11-09 01:10:28,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:10:28,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:10:28,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:10:28,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:10:28,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,876 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-09 01:10:28,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:10:28,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:10:28,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:10:28,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:10:28,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,901 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 01:10:28,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:10:28,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:10:28,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:10:28,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:10:28,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:10:28,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:10:28,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:10:28,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:10:28,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:10:28,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:10:29,000 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:10:29,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:10:29,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:10:29,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:10:29,064 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:10:29,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:10:29,359 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 01:10:29,361 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:10:29,375 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:10:29,376 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:10:29,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:29 BoogieIcfgContainer [2024-11-09 01:10:29,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:10:29,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:10:29,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:10:29,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:10:29,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:10:28" (1/3) ... [2024-11-09 01:10:29,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24350ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:10:29, skipping insertion in model container [2024-11-09 01:10:29,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (2/3) ... [2024-11-09 01:10:29,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24350ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:10:29, skipping insertion in model container [2024-11-09 01:10:29,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:29" (3/3) ... [2024-11-09 01:10:29,385 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-54.i [2024-11-09 01:10:29,398 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:10:29,399 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:10:29,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:10:29,465 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@519edc13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:10:29,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:10:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:10:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:10:29,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:29,485 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:10:29,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:29,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1238406172, now seen corresponding path program 1 times [2024-11-09 01:10:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:10:29,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754855842] [2024-11-09 01:10:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:29,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:10:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:10:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:10:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:10:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:10:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:10:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:10:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:10:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 01:10:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:10:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:10:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:10:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 01:10:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:10:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:10:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 01:10:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:10:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 01:10:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:10:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:10:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 01:10:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:10:29,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:10:29,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754855842] [2024-11-09 01:10:29,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754855842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:29,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:29,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:10:29,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984651628] [2024-11-09 01:10:29,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:29,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:10:29,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:10:29,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:10:29,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:10:29,852 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:10:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:29,877 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2024-11-09 01:10:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:10:29,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2024-11-09 01:10:29,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:29,885 INFO L225 Difference]: With dead ends: 119 [2024-11-09 01:10:29,885 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 01:10:29,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:10:29,890 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:29,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:10:29,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 01:10:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 01:10:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:10:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-11-09 01:10:29,923 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 135 [2024-11-09 01:10:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:29,923 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-11-09 01:10:29,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:10:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-09 01:10:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:10:29,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:29,926 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:10:29,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:10:29,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:29,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash 301675354, now seen corresponding path program 1 times [2024-11-09 01:10:29,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:10:29,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180739616] [2024-11-09 01:10:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:29,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:10:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:10:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:10:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:10:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:10:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:10:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:10:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:10:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 01:10:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:10:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:10:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:10:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 01:10:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:10:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:10:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 01:10:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:10:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 01:10:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:10:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:10:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 01:10:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:10:30,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:10:30,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180739616] [2024-11-09 01:10:30,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180739616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:30,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:30,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:10:30,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405819544] [2024-11-09 01:10:30,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:30,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:10:30,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:10:30,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:10:30,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:10:30,511 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:30,672 INFO L93 Difference]: Finished difference Result 172 states and 256 transitions. [2024-11-09 01:10:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:10:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-11-09 01:10:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:30,674 INFO L225 Difference]: With dead ends: 172 [2024-11-09 01:10:30,675 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 01:10:30,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:10:30,676 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 61 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:30,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 244 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:10:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 01:10:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2024-11-09 01:10:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:10:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2024-11-09 01:10:30,710 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 135 [2024-11-09 01:10:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:30,711 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 148 transitions. [2024-11-09 01:10:30,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 148 transitions. [2024-11-09 01:10:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:10:30,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:30,715 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:10:30,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:10:30,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:30,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash -946500744, now seen corresponding path program 1 times [2024-11-09 01:10:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:10:30,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683708840] [2024-11-09 01:10:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:10:30,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1247773633] [2024-11-09 01:10:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:30,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:10:30,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:10:30,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:10:30,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:10:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:10:31,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:10:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:10:31,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:10:31,582 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:10:31,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:10:31,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:10:31,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:10:31,790 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 01:10:31,865 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:10:31,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:10:31 BoogieIcfgContainer [2024-11-09 01:10:31,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:10:31,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:10:31,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:10:31,868 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:10:31,869 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:29" (3/4) ... [2024-11-09 01:10:31,871 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:10:31,871 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:10:31,872 INFO L158 Benchmark]: Toolchain (without parser) took 3396.88ms. Allocated memory is still 195.0MB. Free memory was 166.2MB in the beginning and 74.8MB in the end (delta: 91.4MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2024-11-09 01:10:31,872 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:10:31,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.67ms. Allocated memory is still 195.0MB. Free memory was 166.2MB in the beginning and 151.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:10:31,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.78ms. Allocated memory is still 195.0MB. Free memory was 151.1MB in the beginning and 148.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:10:31,873 INFO L158 Benchmark]: Boogie Preprocessor took 49.10ms. Allocated memory is still 195.0MB. Free memory was 148.4MB in the beginning and 145.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:10:31,874 INFO L158 Benchmark]: RCFGBuilder took 449.71ms. Allocated memory is still 195.0MB. Free memory was 145.1MB in the beginning and 126.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 01:10:31,874 INFO L158 Benchmark]: TraceAbstraction took 2489.79ms. Allocated memory is still 195.0MB. Free memory was 125.9MB in the beginning and 75.8MB in the end (delta: 50.1MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2024-11-09 01:10:31,874 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 195.0MB. Free memory was 75.8MB in the beginning and 74.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:10:31,876 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.67ms. Allocated memory is still 195.0MB. Free memory was 166.2MB in the beginning and 151.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.78ms. Allocated memory is still 195.0MB. Free memory was 151.1MB in the beginning and 148.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.10ms. Allocated memory is still 195.0MB. Free memory was 148.4MB in the beginning and 145.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.71ms. Allocated memory is still 195.0MB. Free memory was 145.1MB in the beginning and 126.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2489.79ms. Allocated memory is still 195.0MB. Free memory was 125.9MB in the beginning and 75.8MB in the end (delta: 50.1MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 195.0MB. Free memory was 75.8MB in the beginning and 74.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_4 = 256; [L24] signed short int var_1_5 = 0; [L25] signed short int var_1_6 = 25; [L26] signed short int var_1_8 = 100; [L27] unsigned char var_1_9 = 1; [L28] signed short int var_1_10 = -4; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 1; [L32] unsigned long int var_1_14 = 64; [L33] double var_1_15 = 10.3; [L34] double var_1_16 = 128.6; [L35] unsigned long int var_1_17 = 2600113953; [L36] float var_1_18 = 8.25; [L37] float var_1_19 = 31.5; [L38] float var_1_20 = 2.625; [L39] float var_1_21 = 999999999999999.2; [L40] float var_1_22 = 127.5; [L41] unsigned char last_1_var_1_9 = 1; VAL [isInitial=0, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L129] RET updateLastVariables() [L130] CALL updateVariables() [L83] var_1_4 = __VERIFIER_nondet_short() [L84] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L84] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L85] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L86] var_1_5 = __VERIFIER_nondet_short() [L87] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L87] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L88] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L89] var_1_8 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L90] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L91] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L92] var_1_10 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_10 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L93] RET assume_abort_if_not(var_1_10 >= -32768) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L94] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L95] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L95] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L97] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L98] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L98] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L99] var_1_12 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L100] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L101] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L102] var_1_15 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L103] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L104] var_1_16 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L105] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L106] var_1_17 = __VERIFIER_nondet_ulong() [L107] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L107] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L108] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L108] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L109] var_1_19 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L110] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L111] var_1_20 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L112] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L113] var_1_21 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L114] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L115] var_1_22 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L116] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L130] RET updateVariables() [L131] CALL step() [L45] COND TRUE \read(last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=3, var_1_9=1] [L46] COND TRUE var_1_5 == var_1_4 [L47] var_1_6 = ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=33/4, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=-2, var_1_8=3, var_1_9=1] [L54] COND FALSE !(-32 >= (var_1_5 - var_1_8)) [L61] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=-2, var_1_8=3, var_1_9=1] [L63] COND TRUE var_1_18 > var_1_18 [L64] var_1_1 = ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-5, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=-2, var_1_8=3, var_1_9=1] [L68] COND TRUE var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16)))) [L69] var_1_14 = (var_1_17 - (var_1_8 + var_1_4)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-9, var_1_17=-5, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=-2, var_1_8=3, var_1_9=1] [L71] unsigned long int stepLocal_1 = (((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=1, stepLocal_1=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-9, var_1_17=-5, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=-2, var_1_8=3, var_1_9=1] [L72] COND TRUE ((var_1_8 * var_1_1) + var_1_4) >= stepLocal_1 [L73] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-9, var_1_17=-5, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=-2, var_1_8=3, var_1_9=1] [L75] unsigned long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_9=1, stepLocal_0=-9, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-9, var_1_17=-5, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=-2, var_1_8=3, var_1_9=1] [L76] COND TRUE ((var_1_8 % var_1_10) * (8 + var_1_14)) >= stepLocal_0 [L77] var_1_9 = ((! var_1_11) || var_1_12) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-9, var_1_17=-5, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=-2, var_1_8=3, var_1_9=0] [L131] RET step() [L132] CALL, EXPR property() [L122-L123] return ((((((var_1_18 > var_1_18) ? (var_1_1 == ((signed short int) ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2))) : (var_1_1 == ((signed short int) var_1_4))) && (last_1_var_1_9 ? ((var_1_5 == var_1_4) ? (var_1_6 == ((signed short int) ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))))) : (var_1_6 == ((signed short int) var_1_8))) : (var_1_6 == ((signed short int) var_1_4)))) && ((((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) ? (var_1_9 == ((unsigned char) ((! var_1_11) || var_1_12))) : (var_1_9 == ((unsigned char) (! var_1_12))))) && ((((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))) ? (var_1_13 == ((unsigned char) var_1_12)) : 1)) && ((var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16))))) ? (var_1_14 == ((unsigned long int) (var_1_17 - (var_1_8 + var_1_4)))) : 1)) && ((-32 >= (var_1_5 - var_1_8)) ? ((var_1_10 > var_1_6) ? (var_1_18 == ((float) ((var_1_19 - var_1_20) + (var_1_21 + var_1_22)))) : (var_1_18 == ((float) var_1_20))) : (var_1_18 == ((float) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-9, var_1_17=-5, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=-2, var_1_8=3, var_1_9=0] [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-9, var_1_17=-5, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=-2, var_1_8=3, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=1, var_1_10=5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-9, var_1_17=-5, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=-2, var_1_8=3, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 171 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:10:31,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-54.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db928b9099ad3b3be249f0cd14beba37cb15e466f6645711d89dee952c24b933 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:10:34,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:10:34,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:10:34,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:10:34,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:10:34,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:10:34,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:10:34,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:10:34,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:10:34,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:10:34,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:10:34,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:10:34,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:10:34,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:10:34,302 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:10:34,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:10:34,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:10:34,305 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:10:34,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:10:34,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:10:34,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:10:34,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:10:34,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:10:34,307 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:10:34,307 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:10:34,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:10:34,310 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:10:34,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:10:34,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:10:34,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:10:34,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:10:34,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:10:34,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:10:34,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:10:34,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:10:34,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:10:34,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:10:34,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:10:34,312 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:10:34,312 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:10:34,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:10:34,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:10:34,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:10:34,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:10:34,313 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db928b9099ad3b3be249f0cd14beba37cb15e466f6645711d89dee952c24b933 [2024-11-09 01:10:34,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:10:34,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:10:34,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:10:34,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:10:34,567 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:10:34,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-54.i [2024-11-09 01:10:35,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:10:36,075 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:10:36,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-54.i [2024-11-09 01:10:36,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1582b4809/dbfb469eaf0849f88cc30471e71ddc94/FLAGf25ab595c [2024-11-09 01:10:36,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1582b4809/dbfb469eaf0849f88cc30471e71ddc94 [2024-11-09 01:10:36,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:10:36,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:10:36,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:10:36,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:10:36,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:10:36,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c644a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36, skipping insertion in model container [2024-11-09 01:10:36,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:10:36,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-54.i[915,928] [2024-11-09 01:10:36,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:10:36,711 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:10:36,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-54.i[915,928] [2024-11-09 01:10:36,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:10:36,769 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:10:36,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36 WrapperNode [2024-11-09 01:10:36,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:10:36,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:10:36,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:10:36,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:10:36,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,828 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-11-09 01:10:36,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:10:36,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:10:36,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:10:36,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:10:36,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,861 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 01:10:36,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:10:36,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:10:36,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:10:36,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:10:36,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (1/1) ... [2024-11-09 01:10:36,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:10:36,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:10:36,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:10:36,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:10:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:10:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:10:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:10:36,962 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:10:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:10:36,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:10:37,049 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:10:37,050 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:10:40,874 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 01:10:40,874 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:10:40,887 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:10:40,887 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:10:40,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:40 BoogieIcfgContainer [2024-11-09 01:10:40,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:10:40,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:10:40,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:10:40,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:10:40,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:10:36" (1/3) ... [2024-11-09 01:10:40,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb2aaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:10:40, skipping insertion in model container [2024-11-09 01:10:40,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:36" (2/3) ... [2024-11-09 01:10:40,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb2aaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:10:40, skipping insertion in model container [2024-11-09 01:10:40,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:40" (3/3) ... [2024-11-09 01:10:40,894 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-54.i [2024-11-09 01:10:40,905 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:10:40,906 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:10:40,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:10:40,962 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6ca0c577, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:10:40,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:10:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:10:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:10:40,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:40,978 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:10:40,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:40,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1238406172, now seen corresponding path program 1 times [2024-11-09 01:10:40,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:10:40,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296135724] [2024-11-09 01:10:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:40,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:10:40,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:10:40,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:10:40,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:10:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:41,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:10:41,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:10:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-09 01:10:41,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:10:41,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:10:41,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296135724] [2024-11-09 01:10:41,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296135724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:41,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:41,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:10:41,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588183477] [2024-11-09 01:10:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:41,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:10:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:10:41,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:10:41,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:10:41,411 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:10:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:41,431 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2024-11-09 01:10:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:10:41,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2024-11-09 01:10:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:41,440 INFO L225 Difference]: With dead ends: 119 [2024-11-09 01:10:41,440 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 01:10:41,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:10:41,445 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:41,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:10:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 01:10:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 01:10:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:10:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-09 01:10:41,478 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 135 [2024-11-09 01:10:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:41,479 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-09 01:10:41,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:10:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-09 01:10:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:10:41,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:41,481 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:10:41,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:10:41,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:10:41,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:41,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash -91351656, now seen corresponding path program 1 times [2024-11-09 01:10:41,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:10:41,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434693746] [2024-11-09 01:10:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:41,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:10:41,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:10:41,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:10:41,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:10:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:41,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:10:41,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:10:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:10:42,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:10:42,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:10:42,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434693746] [2024-11-09 01:10:42,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434693746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:42,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:42,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:10:42,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484376242] [2024-11-09 01:10:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:42,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:10:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:10:42,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:10:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:10:42,468 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:44,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:47,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:47,320 INFO L93 Difference]: Finished difference Result 172 states and 253 transitions. [2024-11-09 01:10:47,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:10:47,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-11-09 01:10:47,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:47,350 INFO L225 Difference]: With dead ends: 172 [2024-11-09 01:10:47,350 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 01:10:47,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:10:47,351 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 56 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:47,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 241 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-09 01:10:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 01:10:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2024-11-09 01:10:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:10:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-11-09 01:10:47,370 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 135 [2024-11-09 01:10:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:47,371 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-11-09 01:10:47,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:47,371 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-11-09 01:10:47,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:10:47,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:47,373 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:10:47,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:10:47,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:10:47,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:47,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:47,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1339527754, now seen corresponding path program 1 times [2024-11-09 01:10:47,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:10:47,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90517262] [2024-11-09 01:10:47,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:47,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:10:47,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:10:47,579 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:10:47,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:10:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:47,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 01:10:47,929 INFO L278 TraceCheckSpWp]: Computing forward predicates...