./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.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 e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:29:50,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:29:50,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:29:50,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:29:50,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:29:50,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:29:50,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:29:50,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:29:50,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:29:50,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:29:50,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:29:50,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:29:50,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:29:50,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:29:50,680 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:29:50,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:29:50,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:29:50,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:29:50,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:29:50,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:29:50,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:29:50,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:29:50,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:29:50,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:29:50,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:29:50,686 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:29:50,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:29:50,687 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:29:50,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:29:50,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:29:50,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:29:50,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:29:50,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:29:50,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:29:50,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:29:50,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:29:50,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:29:50,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:29:50,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:29:50,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:29:50,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:29:50,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:29:50,692 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 -> e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 [2024-11-20 02:29:50,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:29:50,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:29:50,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:29:50,969 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:29:50,969 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:29:50,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2024-11-20 02:29:52,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:29:52,570 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:29:52,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2024-11-20 02:29:52,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff08dc2e0/e2c64ca8c1214d1fbc287cba51697652/FLAG8d13b45d0 [2024-11-20 02:29:52,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff08dc2e0/e2c64ca8c1214d1fbc287cba51697652 [2024-11-20 02:29:52,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:29:52,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:29:52,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:29:52,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:29:52,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:29:52,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:29:52" (1/1) ... [2024-11-20 02:29:52,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea8b6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:52, skipping insertion in model container [2024-11-20 02:29:52,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:29:52" (1/1) ... [2024-11-20 02:29:52,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:29:53,160 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_codestructure_normal_file-59.i[913,926] [2024-11-20 02:29:53,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:29:53,231 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:29:53,242 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_codestructure_normal_file-59.i[913,926] [2024-11-20 02:29:53,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:29:53,283 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:29:53,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53 WrapperNode [2024-11-20 02:29:53,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:29:53,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:29:53,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:29:53,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:29:53,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,354 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-20 02:29:53,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:29:53,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:29:53,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:29:53,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:29:53,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,392 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-20 02:29:53,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:29:53,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:29:53,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:29:53,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:29:53,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (1/1) ... [2024-11-20 02:29:53,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:29:53,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:29:53,455 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-20 02:29:53,457 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-20 02:29:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:29:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:29:53,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:29:53,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:29:53,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:29:53,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:29:53,554 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:29:53,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:29:53,836 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:29:53,836 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:29:53,856 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:29:53,857 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:29:53,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:29:53 BoogieIcfgContainer [2024-11-20 02:29:53,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:29:53,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:29:53,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:29:53,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:29:53,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:29:52" (1/3) ... [2024-11-20 02:29:53,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2511b9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:29:53, skipping insertion in model container [2024-11-20 02:29:53,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:53" (2/3) ... [2024-11-20 02:29:53,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2511b9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:29:53, skipping insertion in model container [2024-11-20 02:29:53,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:29:53" (3/3) ... [2024-11-20 02:29:53,868 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-59.i [2024-11-20 02:29:53,885 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:29:53,885 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:29:53,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:29:54,001 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;@123cc195, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:29:54,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:29:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 02:29:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 02:29:54,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:29:54,018 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:29:54,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:29:54,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:29:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash -483950726, now seen corresponding path program 1 times [2024-11-20 02:29:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:29:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411307071] [2024-11-20 02:29:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:29:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:29:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:29:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:29:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:29:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:29:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:29:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:29:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:29:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:29:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:29:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:29:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:29:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:29:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:29:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:29:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:29:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 02:29:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 02:29:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:29:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 02:29:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:29:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:29:54,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:29:54,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411307071] [2024-11-20 02:29:54,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411307071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:29:54,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:29:54,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:29:54,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114028805] [2024-11-20 02:29:54,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:29:54,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:29:54,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:29:54,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:29:54,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:29:54,428 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 02:29:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:29:54,455 INFO L93 Difference]: Finished difference Result 115 states and 200 transitions. [2024-11-20 02:29:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:29:54,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-11-20 02:29:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:29:54,464 INFO L225 Difference]: With dead ends: 115 [2024-11-20 02:29:54,464 INFO L226 Difference]: Without dead ends: 57 [2024-11-20 02:29:54,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-20 02:29:54,470 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-20 02:29:54,471 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-20 02:29:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-20 02:29:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-20 02:29:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 02:29:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2024-11-20 02:29:54,511 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 126 [2024-11-20 02:29:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:29:54,512 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2024-11-20 02:29:54,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 02:29:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2024-11-20 02:29:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 02:29:54,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:29:54,517 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:29:54,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:29:54,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:29:54,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:29:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash -709650890, now seen corresponding path program 1 times [2024-11-20 02:29:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:29:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810603951] [2024-11-20 02:29:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:29:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:29:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:29:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:29:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:29:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:29:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:29:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:29:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:29:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:29:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:29:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:29:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:29:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:29:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:29:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:29:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:29:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 02:29:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 02:29:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:29:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 02:29:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:29:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:29:54,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:29:54,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810603951] [2024-11-20 02:29:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810603951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:29:54,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:29:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:29:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916957814] [2024-11-20 02:29:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:29:54,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:29:54,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:29:54,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:29:54,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:29:54,999 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:29:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:29:55,085 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-11-20 02:29:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:29:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-11-20 02:29:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:29:55,088 INFO L225 Difference]: With dead ends: 134 [2024-11-20 02:29:55,090 INFO L226 Difference]: Without dead ends: 80 [2024-11-20 02:29:55,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:29:55,092 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:29:55,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 159 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:29:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-20 02:29:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-11-20 02:29:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:29:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-11-20 02:29:55,121 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 126 [2024-11-20 02:29:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:29:55,122 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-11-20 02:29:55,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:29:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-11-20 02:29:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 02:29:55,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:29:55,126 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:29:55,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:29:55,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:29:55,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:29:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash -193170440, now seen corresponding path program 1 times [2024-11-20 02:29:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:29:55,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933837243] [2024-11-20 02:29:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:29:55,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:29:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:29:55,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925393061] [2024-11-20 02:29:55,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:29:55,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:29:55,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:29:55,279 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-20 02:29:55,281 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-20 02:29:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:29:55,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 02:29:55,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:29:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 435 proven. 114 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-20 02:29:56,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:30:00,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:30:00,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933837243] [2024-11-20 02:30:00,448 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 02:30:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925393061] [2024-11-20 02:30:00,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925393061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:30:00,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 02:30:00,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-20 02:30:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954594768] [2024-11-20 02:30:00,450 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 02:30:00,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 02:30:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:30:00,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 02:30:00,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-11-20 02:30:00,454 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-20 02:30:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:30:01,561 INFO L93 Difference]: Finished difference Result 221 states and 304 transitions. [2024-11-20 02:30:01,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-20 02:30:01,562 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 127 [2024-11-20 02:30:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:30:01,565 INFO L225 Difference]: With dead ends: 221 [2024-11-20 02:30:01,565 INFO L226 Difference]: Without dead ends: 147 [2024-11-20 02:30:01,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=354, Invalid=836, Unknown=0, NotChecked=0, Total=1190 [2024-11-20 02:30:01,568 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 171 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 02:30:01,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 368 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 02:30:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-20 02:30:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 98. [2024-11-20 02:30:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:30:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2024-11-20 02:30:01,585 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 127 [2024-11-20 02:30:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:30:01,586 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2024-11-20 02:30:01,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-20 02:30:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2024-11-20 02:30:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 02:30:01,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:30:01,588 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:30:01,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 02:30:01,789 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-20 02:30:01,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:30:01,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:30:01,790 INFO L85 PathProgramCache]: Analyzing trace with hash 486887930, now seen corresponding path program 1 times [2024-11-20 02:30:01,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:30:01,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144287218] [2024-11-20 02:30:01,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:30:01,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:30:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:30:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:30:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:30:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:30:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:30:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:30:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:30:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:30:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:30:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:30:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:30:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:30:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:30:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:30:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:30:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 02:30:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 02:30:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:30:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 02:30:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:30:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:30:01,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:30:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144287218] [2024-11-20 02:30:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144287218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:30:01,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:30:01,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:30:01,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358549498] [2024-11-20 02:30:01,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:30:01,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:30:01,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:30:01,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:30:01,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:30:01,923 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:30:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:30:01,965 INFO L93 Difference]: Finished difference Result 195 states and 258 transitions. [2024-11-20 02:30:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:30:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-11-20 02:30:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:30:01,967 INFO L225 Difference]: With dead ends: 195 [2024-11-20 02:30:01,968 INFO L226 Difference]: Without dead ends: 100 [2024-11-20 02:30:01,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:30:01,972 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 19 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:30:01,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 162 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:30:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-20 02:30:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2024-11-20 02:30:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 58 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:30:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2024-11-20 02:30:01,993 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 127 [2024-11-20 02:30:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:30:01,994 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2024-11-20 02:30:01,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:30:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2024-11-20 02:30:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 02:30:02,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:30:02,000 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:30:02,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:30:02,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:30:02,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:30:02,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2030045565, now seen corresponding path program 1 times [2024-11-20 02:30:02,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:30:02,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555057747] [2024-11-20 02:30:02,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:30:02,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:30:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:30:02,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937527580] [2024-11-20 02:30:02,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:30:02,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:30:02,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:30:02,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:30:02,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 02:30:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:30:02,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:30:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:30:02,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:30:02,334 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:30:02,336 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:30:02,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 02:30:02,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:30:02,541 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 02:30:02,622 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:30:02,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:30:02 BoogieIcfgContainer [2024-11-20 02:30:02,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:30:02,628 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:30:02,628 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:30:02,628 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:30:02,628 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:29:53" (3/4) ... [2024-11-20 02:30:02,631 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:30:02,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:30:02,634 INFO L158 Benchmark]: Toolchain (without parser) took 9682.52ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 114.7MB in the beginning and 118.6MB in the end (delta: -3.9MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-20 02:30:02,634 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:30:02,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.90ms. Allocated memory is still 184.5MB. Free memory was 114.4MB in the beginning and 98.9MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 02:30:02,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.17ms. Allocated memory is still 184.5MB. Free memory was 98.9MB in the beginning and 94.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:30:02,635 INFO L158 Benchmark]: Boogie Preprocessor took 58.54ms. Allocated memory is still 184.5MB. Free memory was 94.8MB in the beginning and 88.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 02:30:02,635 INFO L158 Benchmark]: RCFGBuilder took 443.80ms. Allocated memory is still 184.5MB. Free memory was 88.1MB in the beginning and 65.7MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 02:30:02,635 INFO L158 Benchmark]: TraceAbstraction took 8766.26ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 65.1MB in the beginning and 119.6MB in the end (delta: -54.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:30:02,635 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 226.5MB. Free memory was 119.6MB in the beginning and 118.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:30:02,640 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.17ms. Allocated memory is still 121.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.90ms. Allocated memory is still 184.5MB. Free memory was 114.4MB in the beginning and 98.9MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.17ms. Allocated memory is still 184.5MB. Free memory was 98.9MB in the beginning and 94.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.54ms. Allocated memory is still 184.5MB. Free memory was 94.8MB in the beginning and 88.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 443.80ms. Allocated memory is still 184.5MB. Free memory was 88.1MB in the beginning and 65.7MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8766.26ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 65.1MB in the beginning and 119.6MB in the end (delta: -54.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 226.5MB. Free memory was 119.6MB in the beginning and 118.6MB 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 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 25; [L26] unsigned short int var_1_5 = 0; [L27] unsigned short int var_1_6 = 62100; [L28] unsigned short int var_1_7 = 27651; [L29] double var_1_8 = 128.9; [L30] unsigned char var_1_9 = 1; [L31] double var_1_10 = 16.5; [L32] double var_1_11 = 25.5; [L33] double var_1_12 = 199.75; [L34] unsigned char var_1_13 = 2; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 1; [L38] unsigned short int var_1_17 = 32; [L39] unsigned char var_1_18 = 1; [L40] unsigned long int var_1_19 = 1; VAL [isInitial=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] FCALL updateLastVariables() [L135] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L94] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L95] var_1_3 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L97] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L100] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L101] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L102] var_1_6 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L103] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L104] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L105] var_1_7 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L106] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L107] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10] [L109] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10] [L110] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L110] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L111] var_1_10 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L112] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L113] var_1_11 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L114] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L115] var_1_12 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L116] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L117] var_1_14 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L118] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L119] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L121] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L122] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L135] RET updateVariables() [L136] CALL step() [L44] COND FALSE !((var_1_3 != (16 / var_1_4)) && var_1_2) [L55] var_1_1 = var_1_3 VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L57] COND FALSE !(var_1_1 < var_1_3) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=255, var_1_5=0, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L60] COND TRUE ! var_1_2 [L61] var_1_5 = ((((var_1_3) > ((var_1_7 + var_1_4))) ? (var_1_3) : ((var_1_7 + var_1_4)))) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=255, var_1_5=16638, var_1_6=-32642, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L64] COND FALSE !(\read(var_1_2)) [L71] var_1_8 = var_1_11 VAL [isInitial=1, var_1_11=2, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=255, var_1_5=16638, var_1_6=-32642, var_1_7=-49153, var_1_8=2, var_1_9=1] [L73] COND TRUE var_1_3 != ((var_1_6 / var_1_4) * ((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5)))) VAL [isInitial=1, var_1_11=2, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=255, var_1_5=16638, var_1_6=-32642, var_1_7=-49153, var_1_8=2, var_1_9=1] [L74] COND TRUE var_1_3 <= var_1_6 [L75] var_1_13 = 32 VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=255, var_1_5=16638, var_1_6=-32642, var_1_7=-49153, var_1_8=2, var_1_9=1] [L82] COND TRUE var_1_12 != var_1_8 [L83] var_1_15 = (! var_1_16) VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=255, var_1_5=16638, var_1_6=-32642, var_1_7=-49153, var_1_8=2, var_1_9=1] [L87] var_1_17 = var_1_4 [L88] var_1_18 = var_1_16 [L89] var_1_19 = var_1_4 VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=255, var_1_5=16638, var_1_6=-32642, var_1_7=-49153, var_1_8=2, var_1_9=1] [L136] RET step() [L137] CALL, EXPR property() [L127-L128] return (((((((((var_1_3 != (16 / var_1_4)) && var_1_2) ? ((var_1_3 > var_1_4) ? (var_1_1 == ((unsigned short int) (var_1_4 + var_1_3))) : (var_1_2 ? (var_1_1 == ((unsigned short int) var_1_3)) : (var_1_1 == ((unsigned short int) var_1_4)))) : (var_1_1 == ((unsigned short int) var_1_3))) && ((var_1_1 < var_1_3) ? (var_1_5 == ((unsigned short int) (var_1_6 - (var_1_7 - var_1_3)))) : ((! var_1_2) ? (var_1_5 == ((unsigned short int) ((((var_1_3) > ((var_1_7 + var_1_4))) ? (var_1_3) : ((var_1_7 + var_1_4)))))) : 1))) && (var_1_2 ? (((! var_1_9) || (var_1_5 < var_1_6)) ? (var_1_8 == ((double) ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))))) : (var_1_8 == ((double) (var_1_11 + var_1_12)))) : (var_1_8 == ((double) var_1_11)))) && ((var_1_3 != ((var_1_6 / var_1_4) * ((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))))) ? ((var_1_3 <= var_1_6) ? (var_1_13 == ((unsigned char) 32)) : (var_1_13 == ((unsigned char) var_1_14))) : (var_1_13 == ((unsigned char) var_1_14)))) && ((var_1_12 != var_1_8) ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && (var_1_17 == ((unsigned short int) var_1_4))) && (var_1_18 == ((unsigned char) var_1_16))) && (var_1_19 == ((unsigned long int) var_1_4)) ; VAL [\result=0, isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=255, var_1_5=16638, var_1_6=-32642, var_1_7=-49153, var_1_8=2, var_1_9=1] [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=255, var_1_5=16638, var_1_6=-32642, var_1_7=-49153, var_1_8=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=255, var_1_5=16638, var_1_6=-32642, var_1_7=-49153, var_1_8=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 775 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 438 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 594 IncrementalHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 337 mSDtfsCounter, 594 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, InterpolantAutomatonStates: 34, 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, 4 MinimizatonAttempts, 66 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 889 NumberOfCodeBlocks, 889 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 2017 SizeOfPredicates, 6 NumberOfNonLiveVariables, 295 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2926/3040 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-20 02:30:02,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.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 e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:30:04,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:30:04,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:30:05,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:30:05,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:30:05,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:30:05,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:30:05,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:30:05,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:30:05,036 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:30:05,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:30:05,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:30:05,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:30:05,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:30:05,038 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:30:05,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:30:05,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:30:05,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:30:05,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:30:05,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:30:05,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:30:05,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:30:05,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:30:05,043 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:30:05,044 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:30:05,047 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:30:05,047 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:30:05,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:30:05,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:30:05,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:30:05,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:30:05,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:30:05,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:30:05,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:30:05,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:30:05,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:30:05,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:30:05,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:30:05,050 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:30:05,051 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:30:05,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:30:05,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:30:05,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:30:05,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:30:05,053 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 -> e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 [2024-11-20 02:30:05,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:30:05,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:30:05,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:30:05,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:30:05,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:30:05,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2024-11-20 02:30:06,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:30:07,191 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:30:07,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2024-11-20 02:30:07,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262248e84/5becf7fda7f24526bee244212a0daac9/FLAGf287b01cf [2024-11-20 02:30:07,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262248e84/5becf7fda7f24526bee244212a0daac9 [2024-11-20 02:30:07,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:30:07,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:30:07,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:30:07,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:30:07,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:30:07,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61be8362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07, skipping insertion in model container [2024-11-20 02:30:07,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:30:07,471 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_codestructure_normal_file-59.i[913,926] [2024-11-20 02:30:07,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:30:07,558 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:30:07,571 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_codestructure_normal_file-59.i[913,926] [2024-11-20 02:30:07,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:30:07,625 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:30:07,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07 WrapperNode [2024-11-20 02:30:07,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:30:07,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:30:07,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:30:07,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:30:07,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,680 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-20 02:30:07,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:30:07,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:30:07,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:30:07,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:30:07,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,724 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-20 02:30:07,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:30:07,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:30:07,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:30:07,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:30:07,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (1/1) ... [2024-11-20 02:30:07,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:30:07,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:30:07,796 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-20 02:30:07,803 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-20 02:30:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:30:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:30:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:30:07,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:30:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:30:07,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:30:07,917 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:30:07,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:30:08,767 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:30:08,767 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:30:08,784 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:30:08,784 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:30:08,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:30:08 BoogieIcfgContainer [2024-11-20 02:30:08,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:30:08,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:30:08,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:30:08,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:30:08,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:30:07" (1/3) ... [2024-11-20 02:30:08,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db6f6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:30:08, skipping insertion in model container [2024-11-20 02:30:08,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:30:07" (2/3) ... [2024-11-20 02:30:08,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db6f6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:30:08, skipping insertion in model container [2024-11-20 02:30:08,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:30:08" (3/3) ... [2024-11-20 02:30:08,796 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-59.i [2024-11-20 02:30:08,814 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:30:08,815 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:30:08,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:30:08,884 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;@51cc5105, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:30:08,885 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:30:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 02:30:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 02:30:08,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:30:08,903 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:30:08,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:30:08,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:30:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash -483950726, now seen corresponding path program 1 times [2024-11-20 02:30:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:30:08,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210250939] [2024-11-20 02:30:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:30:08,927 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-20 02:30:08,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:30:08,931 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-20 02:30:08,932 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-20 02:30:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:09,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:30:09,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:30:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-20 02:30:09,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:30:09,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:30:09,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210250939] [2024-11-20 02:30:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210250939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:30:09,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:30:09,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:30:09,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919823605] [2024-11-20 02:30:09,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:30:09,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:30:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:30:09,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:30:09,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:30:09,317 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 02:30:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:30:09,340 INFO L93 Difference]: Finished difference Result 115 states and 200 transitions. [2024-11-20 02:30:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:30:09,343 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-11-20 02:30:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:30:09,349 INFO L225 Difference]: With dead ends: 115 [2024-11-20 02:30:09,350 INFO L226 Difference]: Without dead ends: 57 [2024-11-20 02:30:09,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-20 02:30:09,356 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-20 02:30:09,356 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-20 02:30:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-20 02:30:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-20 02:30:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 02:30:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2024-11-20 02:30:09,394 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 126 [2024-11-20 02:30:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:30:09,394 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2024-11-20 02:30:09,395 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 02:30:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2024-11-20 02:30:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 02:30:09,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:30:09,403 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:30:09,414 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-20 02:30:09,604 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-20 02:30:09,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:30:09,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:30:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash -709650890, now seen corresponding path program 1 times [2024-11-20 02:30:09,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:30:09,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539251458] [2024-11-20 02:30:09,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:30:09,607 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-20 02:30:09,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:30:09,627 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-20 02:30:09,629 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-20 02:30:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:09,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 02:30:09,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:30:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:30:09,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:30:09,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:30:09,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539251458] [2024-11-20 02:30:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539251458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:30:09,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:30:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:30:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990184083] [2024-11-20 02:30:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:30:09,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:30:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:30:09,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:30:09,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:30:09,922 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:30:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:30:10,839 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-11-20 02:30:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:30:10,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-11-20 02:30:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:30:10,843 INFO L225 Difference]: With dead ends: 134 [2024-11-20 02:30:10,843 INFO L226 Difference]: Without dead ends: 80 [2024-11-20 02:30:10,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:30:10,845 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 29 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 02:30:10,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 174 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 02:30:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-20 02:30:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-11-20 02:30:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:30:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-11-20 02:30:10,864 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 126 [2024-11-20 02:30:10,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:30:10,865 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-11-20 02:30:10,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:30:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-11-20 02:30:10,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 02:30:10,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:30:10,868 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:30:10,881 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-20 02:30:11,069 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-20 02:30:11,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:30:11,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:30:11,071 INFO L85 PathProgramCache]: Analyzing trace with hash 988947254, now seen corresponding path program 1 times [2024-11-20 02:30:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:30:11,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522780619] [2024-11-20 02:30:11,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:30:11,072 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-20 02:30:11,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:30:11,075 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-20 02:30:11,076 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-20 02:30:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:11,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 02:30:11,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:30:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:30:11,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:30:11,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:30:11,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522780619] [2024-11-20 02:30:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522780619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:30:11,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:30:11,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:30:11,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762810609] [2024-11-20 02:30:11,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:30:11,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:30:11,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:30:11,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:30:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:30:11,370 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:30:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:30:11,626 INFO L93 Difference]: Finished difference Result 168 states and 247 transitions. [2024-11-20 02:30:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:30:11,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-11-20 02:30:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:30:11,630 INFO L225 Difference]: With dead ends: 168 [2024-11-20 02:30:11,630 INFO L226 Difference]: Without dead ends: 94 [2024-11-20 02:30:11,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:30:11,632 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 20 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:30:11,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 166 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:30:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-20 02:30:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-11-20 02:30:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 56 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:30:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2024-11-20 02:30:11,644 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 127 [2024-11-20 02:30:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:30:11,645 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-20 02:30:11,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:30:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2024-11-20 02:30:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 02:30:11,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:30:11,647 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:30:11,659 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 (4)] Ended with exit code 0 [2024-11-20 02:30:11,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-20 02:30:11,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:30:11,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:30:11,849 INFO L85 PathProgramCache]: Analyzing trace with hash -193170440, now seen corresponding path program 1 times [2024-11-20 02:30:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:30:11,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604611189] [2024-11-20 02:30:11,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:30:11,850 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-20 02:30:11,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:30:11,854 INFO L229 MonitoredProcess]: Starting monitored process 5 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-20 02:30:11,855 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 (5)] Waiting until timeout for monitored process [2024-11-20 02:30:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:12,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 02:30:12,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:30:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 435 proven. 114 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-20 02:30:13,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:30:40,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:30:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604611189] [2024-11-20 02:30:40,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604611189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:30:40,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [815991319] [2024-11-20 02:30:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:30:40,231 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 02:30:40,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 02:30:40,235 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 02:30:40,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-20 02:30:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:30:40,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 02:30:40,995 INFO L278 TraceCheckSpWp]: Computing forward predicates...